Vector Quantization: High-Rate Theory and Design Algorithms

نویسنده

  • Diego P. de Garrido
چکیده

The performance of opt imum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accompl ished through a general ization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This general ization of the ECVQ algorithm to a conditional entropy-constrained is called CECVQ, i.e., conditional ECVQ. Furthermore, we have extended the high-rate quantization theory to this new class of quantizers to obtain a new high-rate per formance bound, which is a general ization of the works of Gersho and Yamada, Tazaki and Gray. The new performance bound is compared and shown to be consistent with bounds derived through conditional rate-distortion theory. Recently, a new algorithm for designing entropy-constrained vector quantizers was introduced by Garrido, Pearlman, and Finamore, and is named entropy-constrained pairwise nearest neighbor (ECPNN). The algorithm is basically an entropy-constrained version of the pairwise nearest neighbor (PNN) clustering algorithm of Equitz. By a natural extension of the ECPNN algorithm we develop another algorithm, called CECPNN, that designs conditional entropy-constrained vector quantizers. Through simulation results on synthetic sources, we show that CECPNN and CECVQ have very close distortion-rate performance. The advantages of CECPNN over CECVQ are that the CECPNN enables faster codebook design, and for the same distortion-rate per formance the codebooks generated by the CECPNN tend to be smaller. W e have compared the operational distortion-rate curves obtained by the quantization of synthetic sources using CECPNN codebooks with the analytical per formance bound. Surprisingly, the theory based on the high-rate assumption seems to work very well for the tested synthetic sources at lower rates. Zndex TermsSource coding, vector quantization, ratedistortion theory, information theory, entropy coding, clustering methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Clustering Approach Using Data Fusion Theory and its Application To Automatic Isolated Word Recognition

 In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...

متن کامل

Conditional entropy-constrained vector quantization: high-rate theory and design algorithms

The performance of optimum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization o...

متن کامل

Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates

The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms for quantizer design. In this correspondence, the Lagrangian formulation is demonstrated to provide a convenient framework for analyzing the empirical design of variable-rate vector quantizers. In particular, the consistency of e...

متن کامل

CONDITIONAL ENTROPY - CONSTRAINED VECTOR QUANTIZATION : HIGH - RATETHEORY and DESIGN ALGORITHMS 3

{The performance of optimum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization ...

متن کامل

An algorithm for uniform vector quantizer design

A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994